ar X iv : 0 71 0 . 11 83 v 1 [ m at h . C O ] 5 O ct 2 00 7 CONNECTIVITY OF ADDITION CAYLEY GRAPHS
نویسنده
چکیده
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form. 1. Background: addition Cayley graphs For a subset S of the abelian group G, we denote by Cay+G(S) the addition Cayley graph induced by S on G; recall that this is the undirected graph with the vertex set G and the edge set {(g1, g2) ∈ G × G : g1 + g2 ∈ S}. Note that S is not assumed to be symmetric, and that if S is finite, then Cay+G(S) is regular of degree |S| (if one considers each loop to contribute 1 to the degree of the corresponding vertex). The twins of the usual Cayley graphs, addition Cayley graphs (also called sum graphs) received much less attention in the literature; indeed, [A] (independence number), [CGW03] and [L] (hamiltonicity), [C92] (expander properties), and [Gr05] (clique number) is a nearly complete list of papers, known to us, where addition Cayley graphs are addressed. To some extent, this situation may be explained by the fact that addition Cayley graphs are rather difficult to study. For instance, it is well-known and easy to prove that any connected Cayley graph on a finite abelian group with at least three elements is hamiltonian, see [Mr83]; however, apart from the results of [CGW03], nothing seems to be known on hamiltonicity of addition Cayley graphs on finite abelian groups. Similarly, the connectivity of a Cayley graph on a finite abelian group is easy to determine, while determining the connectivity of an addition Cayley graph is a non-trivial problem, to the solution of which the present paper is devoted. The reader will see that investigating this problem leads to studying rather involved combinatorial properties of the underlying group. The first author is supported in part by the National Science Foundation, as an MPS-DRF postdoctoral fellow, under grant DMS-0502193. MSC: 11B75 (05C25, 11P70).
منابع مشابه
ar X iv : 0 71 0 . 27 28 v 1 [ m at h . N T ] 1 5 O ct 2 00 7 PRIMES IN TUPLES II
We prove that lim inf n→∞ pn+1 − pn √ log pn(log log pn) < ∞, where pn denotes the n prime. Since on average pn+1 −pn is asymptotically log pn, this shows that we can always find pairs of primes much closer together than the average. We actually prove a more general result concerning the set of values taken on by the differences p− p between primes which includes the small gap result above.
متن کاملar X iv : 0 71 0 . 35 19 v 1 [ cs . C C ] 1 8 O ct 2 00 7 P - matrix recognition is co - NP - complete
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].
متن کاملar X iv : 0 71 0 . 13 81 v 1 [ m at h . FA ] 6 O ct 2 00 7 On the symplectic phase space of KdV
We prove that the Birkhoff map Ω for KdV constructed on H 0 (T) can be interpolated between H 0 (T) and L20(T). In particular, the symplectic phase space H 1/2 0 (T) can be described in terms of Birkhoff coordinates.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007